Asynchronous automata versus asynchronous cellular automata

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Asynchronous cellular learning automata

Cellular learning automata is a combination of cellular automata and learning automata. The synchronous version of cellular learning automata in which all learning automata in different cells are activated synchronously, has found many applications. In some applications a type of cellular learning automata in which learning automata in different cells are activated asynchronously (asynchronous ...

متن کامل

Weighted Asynchronous Cellular Automata

We study weighted distributed systems whose behavior can be described as a formal power series over a free partially commutative or trace monoid. We characterize the behavior of such systems both, in the deterministic and in the non-deterministic case. As a consequence, we obtain a particularly simple class of sequential weighted automata that have already the full expressive power.

متن کامل

Reversibility in Asynchronous Cellular Automata

The reversibility issue of one-dimensional asynchronous cellular automata (ACAs) is addressed in this paper. The cells of ACAs are updated independently. The cellular automata (CAs) rules are classified as reversible and irreversible rules. The irreversible rules cannot configure reversible ACAs. The reversible rules may configure reversible ACAs depending upon the update of ACA cells. Finally,...

متن کامل

Asynchronous cellular automata for pomsets

This paper extends to pomsets without auto-concurrency the fundamental notion of asynchronous cellular automata (ACA) which was originally introduced for traces by Zielonka. We generalize to pomsets the notion of asynchronous mapping introduced by Cori, Métivier and Zielonka and we show how to construct a deterministic ACA from an asynchronous mapping. Then we investigate the relation between t...

متن کامل

Asynchronous Cellular Automata and Brownian Motion

This paper deals with some very simple interacting particle systems, elementary cellular automata, in the fully asyn-chronous dynamics: at each time step, a cell is randomly picked, and updated. When the initial configuration is simple, we describe the asymptotic behavior of the random walks performed by the borders of the black/white regions. Following a classification introduced by Fatès et a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1994

ISSN: 0304-3975

DOI: 10.1016/0304-3975(94)90232-1